An Analytical Study of Object Identiier Indexing

To avoid OID index retrieval becoming a bottleneck, eecient buuering strategies are needed to minimize the number of disk accesses. In this paper, we develop analytical cost models which we use to nd optimal sizes of the index page buuer and the index entry cache, for diierent memory sizes, index sizes, and access patterns. Because existing buuer hit estimation models are not applicable for index page buuering in the case of tree based indexes, we have also developed an analytical model for index page buuer performance. The cost gain from using the results in this paper is typically in the order of 200-300%. Thus, the results should be of valuable use in optimizers and tools for connguration and tuning of object-oriented database systems.